An Iterative Method of General Planetary Theory

An Iterative Method for

It is of interest in various contexts to nd approximate feasible points to problems that have equality, inequality and bound constraints. For example, in exhaustive search algorithms for global optimization , it is of interest to construct bounds around approximate feasible points, within which a true feasible point is proven to exist. In such exhaustive search algorithms, the approximate feasi...

A Common Fixed Point Theorem Using an Iterative Method

Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence  ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...

An Iterative Rejection Sampling Method

In the note we consider an iterative generalisation of the rejection sampling method. In high energy physics, this sampling is frequently used for event generation, i.e. preparation of phase space points distributed according to a matrix element squared |M |2 for a scattering process. In many realistic cases |M |2 is a complicated multi-dimensional function, so, the standard von Neumann procedu...

OPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD

In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of th...

Application of Iterative Methods for Solving General Riccati Equation